|
|
Post-Quantum Ciphers
Novosadová, Tatiana ; Ricci, Sara (oponent) ; Hajný, Jan (vedoucí práce)
The National Institute for Standards and Technology (NIST) has initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptography algorithms through a public competition. An objective of this thesis is to study the available post-quantum algorithms for key establishment, that were published in the third round of this competition. After a proper analysis and comparison, one of the studied algorithms was implemented using available libraries for the chosen algorithm, the created program was optimized and documented.
|
|
|
Modular network communication using post-quantum cryptography
Kopecký, Samuel ; Malina, Lukáš (oponent) ; Smékal, David (vedoucí práce)
Current cryptography primitives, which are described at the begging of this thesis will be broken by future quantum computers. How they will be broken is described by this thesis along with a very basic description of quantum mechanics which are key to functional quantum computers. Available solutions like post-quantum cryptography are also introduced. More specifically code-based, hash-based and lattice-based cryptography. Lattice-based cryptography is described in most detail and specific NIST standardized algorithms are introduced – Kyber and Dilithium. Along with the theoretical description, an implementation is provided for both of the algorithms and a comparison to existing implementations in the programing language Go. Practical utilization of these algorithms is realized with a modular quantum-resistant communication application. It can send arbitrary data through a quantum-resistant secured channel and is well adjusted to the UNIX universal text interface. Notably it is able to exchange files between two users and also create a Terminal User Interface with which the users can communicate. The underlying protocol that is responsible for creating the secure channel is well defined in the latter chapters of this thesis. The modularity of the applications also allows users to remove or/and add any Key Exchange Mechanism or Digital signature which are responsible for the creation of the secure channel with very few code changes and good integration to the existing components of the application.
|
|
|
An Implementation of Lattice-based Proof-of-Work on Blockchain
Krivulčík, A. ; Ricci, S.
Cryptocurrencies and blockchain are skyrocketing in recent years. They rely on Proof-of-Work (PoW) mechanisms for generating a new transaction and turn this process into ”work” (i.e., puzzles) where miners are paid for. With the advent of quantum computers, also PoW starts to migrate to post-quantum cryptographic alternatives. To the best of our knowledge, we present the first implementation of a lattice-based PoW based on the Shortest Vector Problem (SVP). By implementing in Python 3 and with the use of the NumPy library, we wrote a software that uses this concept on an artificial blockchain and demonstrates its real-world use. Even if this proposal has drawbacks on GPU optimisation and storage requirements, it shows its potential in use. The experimental results show that by balancing the size and generated range of a given matrix and vector, we can easily manipulate the time required to solve SVP challenge.
|
|
|
Post-Quantum Ciphers
Novosadová, Tatiana ; Ricci, Sara (oponent) ; Hajný, Jan (vedoucí práce)
The National Institute for Standards and Technology (NIST) has initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptography algorithms through a public competition. An objective of this thesis is to study the available post-quantum algorithms for key establishment, that were published in the third round of this competition. After a proper analysis and comparison, one of the studied algorithms was implemented using available libraries for the chosen algorithm, the created program was optimized and documented.
|
|
|
Cryptoanalysis of a Post-quantum Cryptography Algorithm
Štumpf, Daniel ; Hojsík, Michal (vedoucí práce) ; Příhoda, Pavel (oponent)
Národní institut standardů a technologie (NIST) v současnosti řídí standardizační proces pro postkvantové kryptografické primitivy. V závislosti na stavebních blocích šif- rovacích algoritmů je rozdělujeme do pěti kategorií. V první části této práce jsme popsali všech pět kategorií a porovnali jejich charakteristiky. Nejdůležitějším aspektem schémat pro NIST je bezpečnost proti klasickým i kvan- tovým protivníkům. V druhé části této práce se zabýváme kryptoanalýzou jedné z pěti kategorií (jmenovitě jsme vybrali kryptosystémy založené na mřížkách). Protože si mys- líme, že bezpečnostní analýza některých kandidátů druhého kola v rámci standardizač- ního projektu NIST není dostatečně popsána v jejich specifikačních dokumentech a ně- které známé útoky nejsou vůbec uvažovány, poskytujeme jednotnou bezpečnostní analýzu těchto schémat. Popsali jsme dva v současnosti známé útoky (primární a duální útoky) proti schématům založeným na mřížkách. Odhadli jsme složitost těchto dvou útoků proti kandidátům ve druhém kole tohoto standardizačního procesu a tyto hodnoty jsme po- rovnali s bezpečností, kterou tito kandidáti uvádějí ve svých specifikačních dokumentech. Ve většině případů se naše odhady shodují s odhady zveřejněnými ve specifikačních do- kumentech, a proto docházíme k závěru, že bezpečnostní odhady jednotlivých...
|
host ::
RSS.